Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
نویسندگان
چکیده
منابع مشابه
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A locating-total dominating set of G is a total dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of...
متن کاملLocating-dominating sets in twin-free graphs
A locating-dominating set a of graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of u. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-dom...
متن کاملLocating and total dominating sets in trees
Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
متن کاملMetric-Locating-Dominating Sets in Graphs
If u and v are vertices of a graph, then d(u, v) denotes the distance from u to v. Let S = {v1, v2, . . . , vk} be a set of vertices in a connected graph G. For each v ∈ V (G), the k-vector cS(v) is defined by cS(v) = (d(v, v1), d(v, v2), · · · , d(v, vk)). A dominating set S = {v1, v2, . . . , vk} in a connected graph G is a metric-locatingdominating set, or an MLD-set, if the k-vectors cS(v) ...
متن کاملOn total dominating sets in graphs
A set S of vertices in a graph G(V,E) is called a dominating set if every vertex v ∈ V is either an element of S or is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex v ∈ V is adjacent to an element of S. The domination number of a graph G denoted by γ(G) is the minimum cardinality of a dominating set in G. Respectively the tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5147